Learning Improvement Heuristics for Solving Routing Problems..

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Admissible Heuristics while Solving Problems

A method is presented that causes A* to return high quality solutions whi le solving a set of problems using a non-admissible heuristic. The heuristic gu id ing the search changes as new informat ion is learned dur ing the search, and it converges to an admissible heuristic wh ich 'contains the insight ' of the or ig ina l nonadmissible one. After a finite number of problems, A * returns only o...

متن کامل

Heuristics and Metaheuristics for Solving Scheduling Problems

Manufacturing scheduling plays a very important function in successful operation of the production planning and control department of an organization. It also offers a great theoretical challenge to the researchers because of its combinatorial nature. Earlier, researchers emphasized classical optimization methods such as linear programming and branch-and-bound method to solve scheduling problem...

متن کامل

Study of Greedy Search with Multiple Improvement Heuristics for Vehicle Routing Problems

Vehicle routing problems have been extensively studied using a variety of search methods and meta-heuristics. However, most search methods are carried out using only a single improvement heuristic. Here, we report on a study using four improvement heuristics embedded in a simple steepest descent search engine. We conclude that reasonable results can be produced quickly by this simple method. A ...

متن کامل

Hybridizing Meta-heuristics Approaches for Solving University Course Timetabling Problems

In this paper we have presented a combination of two metaheuristics, namely great deluge and tabu search, for solving the university course timetabling problem. This problem occurs during the assignment of a set of courses to specific timeslots and rooms within a working week and subject to a variety of hard and soft constraints. Essentially a set of hard constraints must be satisfied in order ...

متن کامل

Heuristics for Service Technician Routing and Scheduling Problems ”

................................................................................................................................... 55

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Neural Networks and Learning Systems

سال: 2021

ISSN: 2162-237X,2162-2388

DOI: 10.1109/tnnls.2021.3068828